Breadth-first search - PDFSEARCH.IO - Document Search Engine

Breadth-first search
Results: 170

#	Item
11	Microsoft PowerPoint - Lecture13_GraphsIII.pptx Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-03-31 12:24:57 Graph theory Mathematics Discrete mathematics Search algorithms Network theory Edsger W. Dijkstra Graph connectivity Depth-first search Breadth-first search Centrality Shortest path problem Connected component
12	WTF: The Who to Follow Service at Twitter Pankaj Gupta, Ashish Goel, Jimmy Lin, Aneesh Sharma, Dong Wang, Reza Zadeh Twitter, Inc. @pankaj @ashishgoel @lintool @aneeshs @dongwang218 @reza_zadeh ABSTRACT Add to Reading List Source URL: www2013.wwwconference.org Language: English - Date: 2014-07-21 08:47:06 Graph theory Mathematics Graph Cycle PageRank Connected component Neighbourhood Vertex Connectivity Topological graph theory Breadth-first search Line graph
13	Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages Maciej Besta Torsten Hoefler Add to Reading List Source URL: htor.inf.ethz.ch Language: English - Date: 2015-09-14 07:27:20 Graph theory Mathematics Computing Concurrency control Transaction processing NP-complete problems Computer memory Transactional memory Vertex Breadth-first search Graph coloring Transactional Synchronization Extensions
14	Orion: Shortest Path Estimation for Large Social Graphs Xiaohan Zhao, Alessandra Sala, Christo Wilson, Haitao Zheng and Ben Y. Zhao Department of Computer Science, UC Santa Barbara, USA {xiaohanzhao, alessandra, bowlin, Add to Reading List Source URL: www.cs.ucsb.edu Language: English - Date: 2010-05-26 02:06:41 Graph theory Mathematics Discrete mathematics Network theory Networks Network analysis Edsger W. Dijkstra Centrality Small-world network Shortest path problem Graph Breadth-first search
15	Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search Scott Beamer EECS Department University of California Berkeley, California Add to Reading List Source URL: crd.lbl.gov Language: English - Date: 2013-03-15 00:51:18 Graph theory Graph connectivity Search algorithms Breadth-first search Graph traversal Spanning tree Strongly connected component Tree Ear decomposition Connected component Graph coloring Maximal independent set
16	High-Productivity and High-Performance Analysis of Filtered Semantic Graphs Aydın Buluç1∗ , Erika Duriakova2 , Armando Fox4 , John R. Gilbert3 , Shoaib Kamil4,5∗ , Adam Lugowski3∗ , Leonid Oliker1 , Samuel Willia Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2013-02-06 05:00:15 Graph theory Mathematics Discrete mathematics Shortest path problem Semiring Graph Adjacency list Breadth-first search
17 $Contemporary Mathematics Graph Partitioning for Scalable Distributed Graph Computations Aydın Bulu¸c and Kamesh Madduri Abstract. Inter-node communication time constitutes a significant fraction$	Contemporary Mathematics Graph Partitioning for Scalable Distributed Graph Computations Aydın Bulu¸c and Kamesh Madduri Abstract. Inter-node communication time constitutes a significant fraction Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2013-03-15 01:10:50 Graph theory Mathematics NP-complete problems Graph partition Hypergraph Graph traversal Breadth-first search Vertex Graph Shortest path problem Ear decomposition HopcroftKarp algorithm
18	Parallel Processing of Filtered Queries in Attributed Semantic Graphs I Adam Lugowskia,∗, Shoaib Kamilb,∗, Aydın Buluçc,∗, Samuel Williamsc , Erika Duriakovad , Leonid Olikerc , Armando Foxe , John R. Gilberta Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2014-09-08 14:04:49 Graph theory Mathematics Algebraic structures Ring theory Semiring Shortest path problem Breadth-first search Graph traversal Neighbourhood Graph
19	PDF Document Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2015-02-21 18:14:23 Graph theory Mathematics Matching Search algorithms Combinatorial optimization HopcroftKarp algorithm Graph traversal Breadth-first search Bipartite graph Depth-first search Ear decomposition Blossom algorithm
20	Parallel Breadth-First Search on Distributed Memory Systems Aydın Buluç Kamesh Madduri Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2013-01-03 20:40:51